The 4-way deterministic tiling problem is undecidable
نویسنده
چکیده
It is shown that the (infinite) tiling problem byWang tiles is undecidable even if the given tile set is deterministic by all four corners, i.e. a tile is uniquely determined by the colors of any two adjacent edges. The reduction is done from the Turing machine halting problem and uses the aperiodic tile set of Kari and Papasoglu. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
The finiteness problem for automaton semigroups is undecidable
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct a Mealy automaton, such that the plane admits a valid Wang tiling if and only if the Mealy autom...
متن کاملThe Nilpotency Problem of One-Dimensional Cellular Automata
The limit set of a celullar automaton consists of all the configurations of the automaton that can appear after arbitrarily long computations. It is known that the limit set is never empty--it contains at least one homogeneous configuration. A CA is called nilpotent if its limit set contains just one configuration. The present work proves that it is algorithmically undecidable whether a given o...
متن کاملThe Finite Tiling Problem is Undecidable in the Hyperbolic Plane
In this paper, we consider the nite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari, see [4]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
متن کاملUndecidability of the Global Fixed Point Attractor Problem on Circular Cellular Automata
A great amount of work has been devoted to the understanding of the long time behavior of cellular automata CA As for any other kind of dynamical system the long time behavior of a CA is described by its attractors In this context it has been proved that it is undecidable to know whether every circular con guration of a given CA evolves to some xed point not unique In this paper we prove that i...
متن کاملThe Computation Complexity of Temperature-1 Tilings
This paper assumes the conventional two-dimensional aTAM for tiling assembly due to Winfree. In this model, aTAM system has a finite set of unit size tiles with glues on their boundaries, a seed tile that is always positioned at the origin, and a glue strength function that determines the affinity of binding between adjacent tiles. It has a parameter τ known as the temperature which determines ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009